Remarks on Multiple Entry Deterministic Finite Automata
نویسنده
چکیده
We investigate several aspects of the multiple entry DFA’s. We consider their DFA conversion. Further, we show that they appear as minimal NFA’s for certain classes of languages. Finally, we deal with their decompositions into disjoint unions of automata with fewer states.
منابع مشابه
Reduction of BL-general L-fuzzy Automata
In this paper, we show that for any BL-general L-fuzzy automaton (BL-GLFA) there exists a complete deterministic accessible reduced BL-general L-fuzzy automaton that recognizing the behavior of the BL-GLFA. Also, we prove that for any finite realization β, there exists a minimal complete deterministic BL-GLFA recognizing β. We prove any complete deterministic accessible reduced BL-GLFA is a min...
متن کاملHyper-Minimization for Deterministic Weighted Tree Automata
Hyper-minimization is a state reduction technique that allows a finite change in the semantics. The theory for hyper-minimization of deterministic weighted tree automata is provided. The presence of weights slightly complicates the situation in comparison to the unweighted case. In addition, the first hyper-minimization algorithm for deterministic weighted tree automata, weighted over commutati...
متن کاملOn the Representation of Finite Automata
We give an unique string representation, up to isomorphism, for initially connected deterministic finite automata (ICDFA’s) with n states over an alphabet of k symbols. We show how to generate all these strings for each n and k, and how its enumeration provides an alternative way to obtain the exact number of ICDFA’s. 1 Motivation In symbolic manipulation environments for finite automata, it is...
متن کاملModel Checking Regular Language Constraints
Even the fastest SMT solvers have performance problems with regular expressions from real programs. Because these performance issues often arise from the problem representation (e.g. non-deterministic finite automata get determinized and regular expressions get unrolled), we revisit Boolean finite automata, which allow for the direct and natural representation of any Boolean combination of regu...
متن کاملCongruences for Visibly Pushdown Languages
We study congruences on words in order to characterize the class of visibly pushdown languages (VPL), a subclass of context-free languages. For any language L, we define a natural congruence on words that resembles the syntactic congruence for regular languages such that this congruence is of finite index if, and only if, L is a VPL. We then study the problem of finding canonical minimal determ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2005